Precoding matrix index reporting method, communications apparatus, and medium

ABSTRACT

This application discloses a precoding matrix index (PMI) reporting method, and related communications apparatus and medium. The method includes: determining an rank indicator (RI) and a PMI, where the PMI is used to determine R precoding matrices W 1 , . . . , W R . An r th  precoding matrix W r  in the R precoding matrices satisfies W r =W 1 ×W 2,r , where an l th  row of W 2,r  is obtained by performing DFT transform on an l th  row of a matrix V 2,r , and R is indicated by the RI. The PMI includes first indication information and second indication information. The first indication information includes location index information. The location index information is used to indicate K m,r  element locations t r,m,1 , . . . ,  ∈{1, . . . , T} on an m th  row of V 2,r . The second indication information is used to indicate K m,r  complex coefficients   at the element locations t r,m,1 , . . . ,   on the m th  row of V 2,r . V 2,r  is determined based on the K m,r  element locations and the K m,r  complex coefficients.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 16/935,549, filed on Jul. 22, 2020, which is a continuation of International Application No. PCT/CN2018/074496, filed on Jan. 29, 2018. All of the afore-mentioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This application relates to the field of wireless communications technologies, and in particular, to a precoding matrix index reporting method, a communications apparatus, and a medium.

BACKGROUND

A multi-input multi-output (MIMO) technology is widely used in a long term evolution (LTE) system. For a user near the cell edge, a space frequency block code (SFBC) transmission mode is used to improve the signal-to-noise ratio (SNR) on a cell edge. For a use near the cell center, a multi-layer parallel transmission mode is used to provide a relatively high data transmission rate. When a base station can obtain all or some downlink channel information, a precoding technology may be used to improve signal transmission quality or increase a signal transmission rate. For a TDD (Time Division Duplexing) system, due to reciprocity of uplink and downlink of a radio channel, a downlink precoding weighted vector can be estimated based on an uplink channel. However, for an FDD (Frequency Division Duplexing) system, because an uplink carrier frequency is different from a downlink carrier frequency, the downlink precoding weighted vector cannot be obtained by using the uplink channel. In an LTE system, a precoding weighted matrix is usually obtained by feedback of a rank indicator (RI) and a precoding matrix indicator (PMI) sent by a terminal user.

To achieve a trade-off between improving feedback precision of the PMI and reducing feedback overheads of the PMI, in the LTE system and a next-generation wireless communications system, the PMI is divided into a PMI 1 and a PMI 2. The PMI 1 indicates a first precoding matrix W1, and is a wideband parameter. The PMI 2 indicates a second precoding matrix W2, and is a subband parameter. In this feedback mechanism, a precoding matrix (W) is obtained by combining W1 and W2, that is: W=W ₁ ×W ₂  (Formula 1), where

W1 is a diagonal block matrix, and each diagonal block matrix includes L basis vectors (for example, two-dimensional discrete Fourier transform (Discrete Fourier Transform, DFT) vectors), that is:

$\begin{matrix} {{W_{1} = \begin{bmatrix} {b_{0}^{m},b_{1}^{m}} & \ldots & b_{L - 1}^{m} & \; & 0 & \; \\ \; & 0 & \; & {b_{0}^{m},b_{1}^{m}} & \ldots & b_{L - 1}^{m} \end{bmatrix}},} & \left( {{Formula}\mspace{14mu} 2} \right) \end{matrix}$ where

b₀ ^(m), b₁ ^(m) . . . b_(L-1) ^(m) is the foregoing L basis vectors, and b_(i) ^(m) (i=0, 1 . . . L−1) may alternatively be understood as a beam vector. The L beam vectors b_(i) ^(m) (i=0, 1 . . . L−1) may be orthogonal to each other.

A W2 matrix on a subband is a 2L×R matrix, and R is indicated by an RI, for example, R=RI+1. When R is 1 and R is 2, specific structures of W2 are respectively as follows:

$\begin{matrix} {W_{2} = {\begin{bmatrix} {p_{0,0,0} \cdot c_{0,0,0}} \\ {p_{0,0,1} \cdot c_{0,0,1}} \\ \ldots \\ {p_{0,0,{L - 1}} \cdot c_{0,0,{L - 1}}} \\ {p_{1,0,0} \cdot c_{1,0,0}} \\ {p_{1,0,1} \cdot c_{1,0,1}} \\ \ldots \\ {p_{1,0,{L - 1}} \cdot c_{1,0,{L - 1}}} \end{bmatrix}\mspace{14mu}{and}}} & \left( {{Formula}\mspace{14mu} 3} \right) \\ {{W_{2} = \begin{bmatrix} {p_{0,0,0} \cdot c_{0,0,0}} & {p_{0,1,0} \cdot c_{0,1,0}} \\ {p_{0,0,1} \cdot c_{0,0,1}} & {p_{0,1,1} \cdot c_{0,1,1}} \\ \ldots & \ldots \\ {p_{0,0,{L - 1}} \cdot c_{0,0,{L - 1}}} & {p_{0,1,{L - 1}} \cdot c_{0,1,{L - 1}}} \\ {p_{1,0,0} \cdot c_{1,0,0}} & {p_{1,1,0} \cdot c_{1,1,0}} \\ {p_{1,0,1} \cdot c_{1,0,1}} & {p_{1,1,0} \cdot c_{1,1,0}} \\ \ldots & \ldots \\ {p_{1,0,{L - 1}} \cdot c_{1,0,{L - 1}}} & {p_{1,1,{L - 1}} \cdot c_{1,1,{L - 1}}} \end{bmatrix}},} & \left( {{Formula}\mspace{14mu} 4} \right) \end{matrix}$ where

p_(r,l,j) represents amplitude information of a coefficient, and c_(p,l,i) represents phase information of the coefficient. Herein, the wideband is entire feedback bandwidth of channel state information (Channel State Indication, CSI), and the subband is a subband in the wideband.

r∈{0,1} represents an index in terms of a dimension of a polarization direction of an antenna, l∈{1, . . . , RI} represents a sequence number of a layer, and i∈{0, . . . , L−1} corresponds to the basis vector b_(i) ^(m).

Generally, the amplitude information and the phase information of the coefficient are quantized based on a predefined quantization set. For example, a quantization set of phases may be

${c_{p,l,i} \in \left\{ {e^{j\frac{\pi\; n}{2}},{n = 0},1,2,3} \right\}},{{{or}\mspace{14mu} c_{p,l,i}} \in {\left\{ {e^{j\frac{\pi\; n}{4}},{n = 0},1,2,3,\ldots\mspace{14mu},7} \right\}.}}$ The amplitude information may be further split into a wideband amplitude p_(r,l,i) ^((WB)) and a subband amplitude p_(r,l,i) ^((SB)) and p_(r,l,i)=p_(r,l,i) ^((WB))p_(r,l,i) ^((SB)). The wideband amplitude feeds back one value in the entire bandwidth, and the subband amplitude feeds back different values for different subbands. The quantization sets of the wideband amplitude and the subband amplitude may be p_(r,l,i) ^((WB))∈{1, √{square root over (0.5)} √{square root over (0.25)} √{square root over (0.125)} √{square root over (0.0625)} √{square root over (0.0313)} √{square root over (0.0156)} 0} and p_(r,l,i) ^((SB))∈{1 √{square root over (0.5)}} respectively.

In the prior art, UE notifies, by reporting the PMI 1 and the PMI 2, a base station of a precoding matrix selected by the UE. The PMI 1 is used to indicate W1, and the PMI 2 is used to indicate W2. To reduce feedback overheads, it is usually assumed that W1 is the same in the entire CSI feedback bandwidth and for all RI layers, that is, W1 is a common parameter. However, the values of W2 of different subbands and different layers of each subband in the entire bandwidth may be different. Therefore, the PMI 1 is known as a wideband feedback parameter, and the PMI 2 is known as a subband feedback parameter. Because W2 relates to feedbacks of amplitudes and phases of 2L coefficients, a feedback of the PMI 2 on each subband requires a relatively large quantity of bits. Further, when a quantity of subbands is relatively large or the value of R is relatively large, the total feedback overhead of the PMI 2 increases rapidly. Therefore, how to reduce feedback overhead of PMI 2 indices is a technical problem that currently needs to be resolved.

SUMMARY

Embodiments of the present invention provide a precoding matrix index reporting method, a communications apparatus, and a medium, to reduce resource overheads occupied when a terminal reports a precoding matrix index.

The embodiments of the present invention may be specifically implemented by using the following technical solutions.

According to a first aspect, an embodiment of the present invention provides a precoding matrix index reporting method, applied to a first communications apparatus side. The method includes: The first communications apparatus determines a rank indicator RI and a precoding matrix indicator PMI, where the PMI is used to determine R precoding matrices W₁, . . . and W_(R), and an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies W_(r) W₁×W_(2,r), and r∈{1, . . . , R}. W₁ is a matrix of N rows and 2L columns, W_(2,r) is a matrix of 2L rows and F columns, an l_(th) row of W_(2,r) is obtained by performing DFT transform on an l_(th) row of a matrix V_(2,r), V_(2,r) is a matrix of 2L rows and T columns, R is indicated by the RI, and Z∈{1 . . . , 2L}. The PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,l), . . . ,

∈{1, . . . , T} on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), where V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L} and i∈{1, . . . , K_(m,r)}. R is a non-negative integer, N, L, F, T, and K_(m, r) are all positive integers, K_(m,r) is less than T, and F is less than or equal to T. The first communications apparatus sends the RI and the PMI.

According to a second aspect, an embodiment of the present invention provides a precoding matrix index reporting method, applied to a second communications apparatus side. The method includes: The second communications apparatus receives a rank indicator RI and a precoding matrix indicator PMI. The second communications apparatus determines R precoding matrices W₁, . . . , W_(R) based on the PMI, where an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies W_(r)=W₁×W_(2,r), and r∈{1, . . . , R}. W₁ is a matrix of N rows and 2L columns, W_(2,r) is a matrix of 2L rows and F columns, an l_(th) row of W_(2,r) is obtained by performing DFT transform on an l_(th) row of a matrix V_(2,r), V_(2,r) is a matrix of 2L rows and T columns, R is indicated by the RI, and l∈{1 . . . , 2L}. The PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈∈{1, . . . , T} on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), where V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1 . . . , 2L, and i∈1, . . . , K_(m,r)}. The RI is a non-negative integer, N, L, F, T, R, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is less than or equal to T.

During implementation of the method described in the first aspect or the second aspect, when the precoding matrix index is reported, only some element locations and coefficients at some element locations may be reported. Therefore, resource overheads occupied for reporting the precoding matrix index can be reduced.

Optionally, in this embodiment of the present invention, an element x belongs to a set X, and x∈X represents that the element x may be any value in the set X, but does not need to traverse each value in X. For example, the foregoing m∈{1, . . . , 2L} may indicate that when m is any element in {1, . . . , 2L}, and when the method described in the first aspect or the second aspect is implemented, that “the PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T} on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), where V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,m,j) , m∈{1, . . . , 2L} and i∈{1, . . . , K_(m,r)}.” is true. Alternatively, it may indicate that, when m is any one of some elements in {1, . . . , 2L}, during implementation of method described in the first aspect or the second aspect, that “the PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . ,t_(r,m,K) _(m,r) ∈{1, . . . , T} on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), where V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m,r)}.” is true, and if m is a value other than some elements, the foregoing method is not true.

In a specific example, that “the PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . ,t_(r,m,K) _(m,r) ∈{1, . . . , T} on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), where V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L} and i∈{1, . . . , K_(m,r)}” indicates that: The first indication information includes the location index information, the location index information indicates K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T} (m represents a row number) on each of 2L−1 rows other than an m_(0 th) row from a first row to a (2L)^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) (m represents a row number) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on each of the 2L−1 rows other than the m_(0 th) row from the first row to the (2L)^(th) row of V_(2,r). In this case, K_(m0,r) element locations and corresponding complex coefficients on the m_(0 th) row may be determined by using a predefined method, and therefore do not need to be indicated by using the PMI. In this case, that “V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,1) _(r,m,i) ” is specifically that: V_(2,r) is determined by K_(m,r) element locations on rows other than the m_(0 th) row, the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , and predefined element locations and coefficient values on the m_(0 th) row.

Optionally, for the m^(th) row of V_(2,r), complex coefficients at element locations other than the K_(m,r) element locations may be a predefined value, for example, 0. In this case, that “V_(2,r) is determined by the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) ” is specifically that: V_(2,r) is determined by the K_(m,r) element locations, the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , and the coefficient 0 at the element locations other than the K_(m,r) element locations.

Optionally, a rule that R is indicated by the RI may be determined according to a predefined rule. For example, when a value of the RI is a binary number starting from 00, R=f(RI)+1, as shown in Table 1. Alternatively, when a value of the RI is a binary number starting from 01, R=f(RI), as shown in Table 2. The function f(x) represents conversion from the binary sequence x to decimal integers.

TABLE 1 RI R 00 1 01 2 10 3 . . . . . .

TABLE 2 RI R 01 1 10 2 . . . . . .

For another example, when a value of the RI is an integer starting from 0, R=RI+1, as shown in Table 3. Alternatively, when a value of the RI is an integer starting from 1, R=RI, as shown in Table 4.

TABLE 3 RI R 0 1 1 2 2 3 . . . . . .

TABLE 4 RI R 1 1 2 2 . . . . . .

Optionally, there may be a plurality of methods for determining the precoding matrix based on the PMI during implementation in which “the PMI is used to determine R precoding matrices W₁, . . . , W_(R)” according to the first aspect and during implementation in which “the second communications apparatus determines R precoding matrices W₁, . . . , W_(R) based on the PMI” according to the second aspect. For example, the first communications apparatus and the second communications apparatus may store precoding matrices W₁, . . . , W_(R) with different PMI values, and then determine, based on the reported PMI, the precoding matrices W₁, . . . , W_(R) selected by the first communications apparatus. Alternatively, a table is predefined in a standard, and the first communications apparatus and the second communications apparatus may obtain the precoding matrices W₁, . . . , W_(R) through calculation based on values of parameters included in the PMI by using the table. In this case, the first communications apparatus and the second communications apparatus may calculate, based on the reported PMI, the precoding matrices selected by the first communications apparatus.

With reference to the first aspect or the second aspect, in a possible design, RI≥2, and for an m^(th) row, the location index information indicates a group of locations c_(m,1), . . . , c_(m,K) _(m) , where the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate K_(m,r) element locations on an m^(th) row of each of R matrices V_(2,1), . . . , V_(2,R), that is t_(r,m,i)=c_(m,i) and K_(m,r)=K_(m), where m∈{1, . . . , 2L} and i∈{1, . . . , K_(m)}. During implementation of this embodiment of the present invention, when the element locations on the m^(th) row of the V_(2,r) matrix are reported, for the m^(t) row of all the R V_(2,r) matrices, only one group of locations may be reported, that is, values of the reported K_(m,r) element locations for different values of r are the same. As compared with a manner in which a group of locations on the m^(th) row of each V_(2,r) matrix is separately reported, feedback overheads of the PMI are reduced in this embodiment of the present invention.

It should be noted that, an implementation in which “the location index information indicates a group of locations c_(m,1), . . . , c_(m,K) _(m) ” is that: The location index information includes K_(m) element locations c_(m,1), . . . , c_(m,K) _(m) , and a second implementation is that: The location index information includes M_(m) reference locations and window sizes respectively corresponding to M_(m) reference locations, and the K_(m) element locations c_(m,1) . . . , c_(m,K) _(m) may be determined based on the M_(m) reference locations and the window sizes respectively corresponding to the M_(m) reference locations.

That “the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate K_(m,r) element locations on an m^(th) row of each of R matrices V_(2,1), . . . , V₂” is that: The K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) may be determined based on the group of locations c_(m,1), . . . , c_(m,K) _(m) , that is, t_(r,m,i)=c_(m,i).

It should be noted that parameters of the PMI that are actually reported are parameters determined based on the group of locations c_(m,1), . . . , c_(m,K) _(m) , but are not based on the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) .

With reference to the first aspect or the second aspect, in a possible design, the location index information includes indication information of M_(m) reference locations, the indication information of the M_(m) reference locations is used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) and M_(m) is a positive integer less than T.

It should be noted that, that “the indication information of the M_(m) reference locations is used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) ” is that: The group of locations c_(m,1), . . . , c_(m,K) _(m) may be determined based on the M_(m) reference locations.

With reference to the first aspect or the second aspect, in a possible design, for the m^(th) row, the location index information further includes a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer; or a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations is configured by using first configuration information, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer.

There are a plurality of methods for determining the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) based on the M_(m) window sizes X_(m,n) and the M_(m) reference locations. M_(m)=1 is used as an example. Optionally, X_(m,n) locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, where the X_(m,n) locations are included in the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . In this case, 1+X_(m,n)=K_(m). Optionally, X_(m,n) locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, where the X_(m,n) locations are the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . In this case, X_(m,n)=K_(m). Similar to the foregoing two methods, X_(m,n) locations starting from a reference location may alternatively be counted along a direction in which a column number of the matrix V_(2,r) decreases. Details are not described again. Optionally, a reference location is used as a central location, X_(m,n) locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the 2X_(m,n)+1 locations are the K_(m) locations c_(m,1), . . . c_(m,K) _(m) . Optionally, a reference location is used as a central location, X_(m,n)/2 locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the X_(m,n)+1 locations are the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . There may be another determining manner. This is not excluded herein.

With reference to the first aspect or the second aspect, in a possible design, when a quantity M_(m) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the M_(m) reference locations, and relative location information that is of each of M_(m)−1 reference locations, other than the first reference location, in the M_(m) reference locations and that is relative to the first reference location, where one piece of absolute location information and other M_(m)−1 pieces of relative location information are used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) . Optionally, the absolute location information is location information relative to a value 0 in column numbers ranging from 1 to T of the matrix V_(2,r). For example, if absolute location information of a first reference location on the m^(th) row is T₀ (a value range is 0 to T−1), the first reference location is located on the m^(th) row and the (mod(T₀, T)+1)^(th) column of the matrix. For another example, if absolute location information of a first reference location on the m^(t) row is T₀ (a value range is 1 to T), the first reference location is located on the m^(th) row and the (mod(T0−1, T)+1)^(th) column of the matrix. Optionally, the relative location information indicates a relative location relative to the absolute location information T₀. M_(m)=2 is used as an example. Assuming that the relative location information is ΔT (ΔT is an integer), an element location indicated by the relative location information is on the m^(th) row and the (mod(ΔT+T₀)+1)^(th) column (if a value of T₀ starts from 0) of V_(2,r). or is on the m^(th) row and the (mod(ΔT+T₀−1)+1)^(th) column (if a value of T₀ starts from 1) of V_(2,r). During implementation of this embodiment of the present invention, due to a time domain characteristic of a channel, that is, delays of a plurality of sub-paths of the channel in time domain are usually relatively centralized, a value interval of relative location information of the M_(m)−1 elements is far less than a value interval of absolute location information. Therefore, a quantity of quantization bits of quantized location information can be reduced in a manner of reporting the relative location information, thereby reducing feedback overheads of the PMI. For example, if there are a total of 64 sampling points in time domain in terms of multipath delays of a channel, it indicates that one piece of absolute location information of the element needs to be represented by using 6 bits. When values of the multipath delays of the channel are relatively centralized, for example, the multipath delays of the channel are all within 16 sampling points after the first absolute location, each piece of relative location information of the element needs to be represented by using 4 bits. Therefore, feedback overheads of the PMI can be reduced by reporting the relative location information.

With reference to the first aspect or the second aspect, in a possible design, the location index information further includes G_(m) groups of fourth indication information, and an n^(th) (1≤n≤G_(m)) group of fourth indication information is used to indicate Z_(m,n) element locations selected from Y_(m,n) element locations, where the Y_(m,n) element locations are determined based on the n^(th) reference location in the G_(m) reference locations and a window size X_(m,n) associated with the n^(th) reference location, Z_(m,n) is a positive integer less than or equal to Y_(m,n), and the G_(m) reference locations, the G_(m) window sizes, and the G_(m) pieces of fourth indication information are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) .

With reference to the first aspect or the second aspect, in a possible design, R≥1, and the location index information indicates R groups of locations, where an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is n∈{1, . . . , 2L}, m∈{1, . . . , 2L} and n≠m, and it satisfies that t_(r,m,i)=t_(r,n,i)=c_(r,i), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . K_(r)}, and r∈{1, . . . , R}. Optionally, the two rows may be different two rows in the R matrices. For example, in the matrix V_(2,1), a reported group of locations indicates element locations on an (n1)^(th) row and an (m1)^(th) row; and in the matrix V_(2,2), a reported group of locations indicates element locations on an (n2)^(th) row and an (m2)^(th) row. Optionally, the two rows may be the same two rows in the R matrices. During implementation of this embodiment of the present invention, for at least two rows in each of the R matrices V_(2,1), . . . , V_(2,R), only one group of locations may be reported. As compared with a manner in which a group of locations on each row of the matrix V_(2,r) is separately reported, feedback overheads of the PMI are reduced. Further, optionally, for 2L−1 rows of an r^(th)V_(2,r) matrix, only one group of locations is reported, that is, t_(r,m,i)=c_(r,K) _(r) , and K_(m,r)=K_(r), so that feedback overheads of the PMI can be further reduced. Similarly, the 2L−1 rows may be different 2L−1 rows in the R matrices, or may be the same 2L−1 rows.

It should be noted that, an implementation in which “the location index information indicates R groups of locations” is that: The location index information includes the R groups of locations, and a second implementation is that: The location index information includes M_(r) reference locations and window sizes respectively corresponding to the M_(r) reference locations, and the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations may be determined based on the M_(r) reference locations and the window sizes respectively corresponding to the M_(r) reference locations.

That “an r^(th) group of locations c_(r,1), . . . c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r)” is that: The K_(m,r) element locations on at least two rows in V_(2,r) may be determined based on the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations.

Parameters of the PMI that are actually reported are parameters determined based on the r^(th) group of locations c_(r,1), . . . c_(r,K) _(r) in the R groups of locations, but are not based on the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) .

With reference to the first aspect or the second aspect, in a possible design, the location index information includes indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.

With reference to the first aspect or the second aspect, in a possible design, the location index information further includes a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.

There are a plurality of methods for determining the K_(r) locations c_(r,1), . . . , c_(r,K) _(r) based on the M_(r) window sizes X_(r,n) and the M_(r) reference locations. M_(r)=1 is used as an example. Optionally, X_(r,n) locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, where the X_(r,n) locations are included in the K_(r) locations c_(r,1), . . . , c_(r,K) _(r) . In this case, 1+X_(r,n)=K_(r). Optionally, X_(r,n)−1 locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, where the X_(r,n) locations are the K_(r) locations c_(r,1), . . . , c_(r,K) _(r) . In this case, X_(r,n)=K_(r). Similar to the foregoing two methods, X_(r,n) locations starting from a reference location may alternatively be counted along a direction in which a column number of the matrix V_(2,r) decreases. Details are not described again. Optionally, a reference location is used as a central location, X_(r,n) locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the 2X_(r,n)+1 locations are the K_(r) locations. Optionally, a reference location is used as a central location, X_(r,n)/2 locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the X_(r,n)+1 locations are the K_(r) locations. There may be another determining manner. This is not excluded herein.

With reference to the first aspect or the second aspect, in a possible design, for each of the R matrices V_(2,1), . . . , V_(2,r) and at least two rows in each matrix, only one group of locations is reported. As compared with a manner in which one group of locations on each row in the R V_(2,r) matrices is separately reported, feedback overheads of the PMI are reduced. Further, optionally, in a possible design, for each of the R matrices V_(2,1), . . . , V_(2,R) and 2L−1 rows of each matrix, only one group of locations is reported. In this case, for an r^(th) matrix V_(2,r), an element location on an i_(r) _(th) row does not need to be reported by using the index information, but uses a predefined value. A row number index of the i_(r) _(th) row of the r^(th) matrix may be reported by the first communications apparatus to the second communications apparatus.

With reference to the first aspect or the second aspect, in a possible design, when a quantity M_(r) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the M_(r) reference locations, and relative location information that is of each of M_(r)−1 reference locations, other than the first reference location, in the M_(r) reference locations and that is relative to the first reference location. During implementation of this embodiment of the present invention, due to a time domain characteristic of a channel, that is, delays of a plurality of sub-paths of the channel in time domain are usually relatively centralized, a value interval of relative location information of the M_(r)−1 elements is far less than a value interval of absolute location information. Therefore, a quantity of quantization bits of quantized location information can be reduced in a manner of reporting the relative location information, thereby reducing feedback overheads of the PMI. For example, if there are a total of 64 sampling points in time domain in terms of multipath delays of a channel, it indicates that one piece of absolute location information of the element needs to be represented by using 6 bits. When values of the multipath delays of the channel are relatively centralized, for example, the multipath delays of the channel are all within 16 sampling points after the first absolute location, each piece of relative location information of the element needs to be represented by using 4 bits. Therefore, feedback overheads of the PMI can be reduced by reporting the relative location information. For the absolute location information and the relative location information, refer to the foregoing explanations. Details are not described again.

With reference to the first aspect or the second aspect, in a possible design, the location index information further includes G_(r) groups of fourth indication information, and an n^(th) (1≤n≤G_(r)) group of fourth indication information is used to indicate Z_(r,n) element locations selected from Y_(r,n) element locations, where the Y_(r,n) element locations are determined based on an n^(th) reference location in the G_(r) reference locations and a window size X_(r,n) associated with the n^(th) reference location, Z_(r,n) is a positive integer less than or equal to Y_(r,n), and the G_(r) reference locations, the G_(r) window sizes, and the G_(r) pieces of fourth indication information are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations.

With reference to the first aspect or the second aspect, in a possible design, the first indication information further includes indication information of |A| first element locations τ_(r,m) and one second element location γ_(r) of V_(2,r), m∈A, the set A is a non-empty subset of a set {1, . . . , 2L}, |A| represents a quantity of elements in the set A, and r∈{1, . . . , R}. τ_(r,m) is an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,i) | in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) , and the second element location γ_(r) is an element location with a maximum coefficient amplitude |a_(r,m,τ) _(r,m) | in the |A| first element locations τ_(r,m). The second indication information includes relative values of all or some of coefficients a_(r,m,t) _(r,m,i) at K_(m,r)−1 element locations, other than the first element location, in the K_(m,r) element locations and a coefficient a_(r,m,τ) _(r,m) at the first element location τ_(r,m); and the second indication information further includes relative values of all or some coefficients a_(r,m,τ) _(r,m) at |A|−1 first element locations, other than the second element location γ_(r), in the |A| first element locations τ_(r,m) and a coefficient a_(r,m,γ) _(r) at the second element location γ_(r). During implementation of this embodiment of the present invention, the coefficients are reported in a normalized manner, so that feedback overheads of the PMI can be reduced. In addition, in this embodiment of the present invention, coefficient normalization of each row is performed only based on a maximum value of a coefficient amplitude of the row, so that a case can be avoided in which coefficients of many rows are normalized and quantized to 0 values because a maximum value of a coefficient amplitude of some rows is far greater than a maximum value of a coefficient amplitude of another row, and in this way, feedback overheads of the PMI are reduced, and feedback precision of the PMI is ensured.

With reference to the first aspect or the second aspect, in a possible design, the first indication information includes a third element location γ_(r) of V_(2,r), and γ_(r) is used to indicate an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,i) | at element locations

$\bigcup\limits_{m \in A}{\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}.}$ The second indication information includes relative values of all or some coefficients at element locations, other than the third element location γ_(r), in the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ and a coefficient at the location γ_(r), where

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ is a set obtained by obtaining a union set of sets {t_(r,m,1), . . . , t_(r,m,K) _(m) } corresponding to all elements m belonging to the set A. During implementation of this embodiment of the present invention, the coefficients are reported in a normalized manner, so that feedback overheads of the PMI can be reduced.

Optionally, the set A is a non-empty proper subset of the set {1, . . . , 2L}. In this case, the first indication information includes indication information of a first element location τ_(r,m) and one second element location γ_(r) that are on some rows of V_(2,r), but does not include a first element location τ_(r,m) on at least one row. The second indication information includes coefficient information of some rows of V_(2,r), but does not include coefficient information of at least one row. A predefined value may be used respectively for the first element location τ_(r,m) on the at least one row that is not included in the first indication information and the coefficient information of the at least one row that is not included in the second indication information. Optionally, the set A may be different for different R matrices V_(2,1), . . . , V_(2,R). In a possible design, the method further includes: The second communications apparatus sends second configuration information, and the first communications device receives the second configuration information, where the second configuration information is used to indicate that: For an m^(th) row, the location index information includes only one group of locations c_(m,1), . . . , c_(m,K) _(m) , and the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate K_(m,r) element locations on the m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R).

With reference to the first aspect or the second aspect, in a possible design,

$W_{1} = \begin{bmatrix} X & 0 \\ 0 & X \end{bmatrix}$ is a matrix of N×2L, X=[b_(k) ₀ . . . b_(k) _(L-1) ] is a matrix of

${\frac{N}{2} \times L},$ and b_(k) _(i) (0≤i≤L−1) belongs to a vector set B={b₀, b₁, . . . b_(M-1)}, the PMI further includes third indication information, the third indication information is used to indicate L vectors b_(k) ₀ , . . . ,b_(k) _(L-1) , M is a positive integer, and M is greater than or equal to L.

With reference to the first aspect or the second aspect, in a possible design, V_(2,r)=[V_(2,r,1) . . . V_(2,r,T)], where a t^(th) column in V_(2,r) is V_(2,r,t)=[a_(r,1,t) . . . a_(r,2L,t)]^(T), 1≤t≤T, [ ]^(T) represents transposing, and a_(r,m,t)(1≤m≤2L) represents complex coefficients at locations on the m^(th) row and the t^(th) column of V_(2,r).

In a possible design, the method further includes: The second communications apparatus sends third configuration information, and the first communications device receives the third configuration information, where the third configuration information is used to indicate that the location index information includes only R groups of locations, and an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) is used to indicate K_(m,r) element locations on at least two rows in V_(2,r).

In a possible design, the method further includes: quantities of quantization bits of at least two relative values in the relative values that are of the coefficients and that are included in the second indication information are different. A beneficial effect is that quantization precision of a coefficient with a relatively large amplitude can be improved, quantization precision of a coefficient with a relatively small amplitude can be reduced, and a compromise between quantization precision and feedback overheads can be achieved.

Optionally, the foregoing method may be that: m∈A, n∈A, m is not equal to n, and it satisfies that a quantity of quantization bits of the relative values that are of all or some of coefficients a_(r,m,t) _(r,m,i) at the K_(m,r)−1 element locations and the coefficient a_(r,m,τ) _(r,m) at the first element location τ_(r,m) and that are included in the second indication information is different from a quantity of quantization bits of the relative values that are of all or some coefficients a_(r,n,t) _(r,n,j) at the K_(n,r)−1 element locations and the coefficient a_(r,n,τ) _(r,n) at the first element location τ_(r,n) and that are included in the second indication information.

Optionally, the foregoing method may be that: In relative values that are of all or some coefficients at element locations, other than the third element location γ_(r), in the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ and that are included in the second indication information, quantities of quantization bits of at least two relative values are different.

With reference to the first aspect or the second aspect, in a possible design, N is a quantity of antenna ports of the second communications apparatus, L is a quantity of vectors included in the W₁ matrix selected by the first communications apparatus, and a value of L may be configured by the second communications apparatus, or may be reported by the first communications apparatus.

With reference to the first aspect or the second aspect, in a possible design, the DFT transform may be completed by performing a DFT operation, or may be obtained by performing mathematical transform by multiplying a DFT matrix.

With reference to the first aspect or the second aspect, in a possible design, the DFT transform may be fast Fourier transform (FFT) transform. Calculation results are equivalent by using DFT transform or FFT transform.

With reference to the first aspect or the second aspect, in a possible design, the PMI includes a PMI 1 and a PMI 2, and the PMI 2 includes the first indication information and the second indication information. The PMI 1 includes the third indication information.

It should be noted that, in this embodiment of this application, in a description that A is used to determine B and in a similar description, there are a plurality of determining methods. For example, values of B corresponding to different values of A are pre-stored. Therefore, a corresponding value of B may be determined based on different values of A. Alternatively, a calculation rule is predefined, and a corresponding value of B may be calculated based on different values of A.

According to a third aspect, an embodiment of this application provides a first communications apparatus. The first communications apparatus includes a plurality of functional units, configured to correspondingly perform the precoding matrix index reporting method according to any one of the first aspect or the possible implementations of the first aspect.

According to a fourth aspect, an embodiment of this application provides a second communications apparatus. The second communications apparatus includes a plurality of functional units, configured to correspondingly perform the precoding matrix index reporting method according to any one of the second aspect or the possible implementations of the second aspect.

According to a fifth aspect, an embodiment of this application provides a first communications apparatus, configured to perform the precoding matrix index reporting method described in the first aspect. The first communications apparatus may include a memory, and a processor, a transmitter, and a receiver that are coupled to the memory. The transmitter is configured to send a signal to another communications apparatus, for example, a network device. The receiver is configured to receive a signal sent by the other communications apparatus, for example, the network device. The memory is configured to store implementation code of the precoding matrix index reporting method described in the first aspect. The processor is configured to execute program code stored in the memory, that is, perform the precoding matrix index reporting method described in any one of the first aspect or the possible implementations of the first aspect. Optionally, when performing a sending operation, the processor drives or controls the transmitter to perform the sending. Optionally, when performing a receiving operation, the processor drives or controls the receiver to perform the receiving.

According to a sixth aspect, an embodiment of this application provides a second communications apparatus, configured to perform the precoding matrix index reporting method described in the second aspect. The second communications apparatus may include a memory, and a processor, a transmitter, and a receiver that are coupled to the memory. The transmitter is configured to send a signal to another communications apparatus, for example, a terminal device. The receiver is configured to receive a signal sent by the other communications apparatus, for example, the terminal device. The memory is configured to store implementation code of the precoding matrix index reporting method described in the second aspect. The processor is configured to execute program code stored in the memory, that is, perform the precoding matrix index reporting method described in any one of the second aspect or the possible implementations of the second aspect. Optionally, when performing a sending operation, the processor drives or controls the transmitter to perform the sending. Optionally, when performing a receiving operation, the processor drives or controls the receiver to perform the receiving.

According to a seventh aspect, an embodiment of this application provides a communications system. The communications system includes a first communications apparatus and a second communications apparatus. The first communications apparatus includes the first communications apparatus according to the third aspect or the fifth aspect, and the second communications apparatus includes the second communications apparatus according to the fourth aspect or the sixth aspect.

According to an eighth aspect, an embodiment of this application provides a computer-readable storage medium. The computer-readable storage medium stores an instruction. When the instruction is run on a processor, the processor is enabled to perform the precoding matrix index reporting method described in the first aspect.

According to a ninth aspect, an embodiment of this application provides a computer-readable storage medium. The computer-readable storage medium stores an instruction. When the instruction is run on a processor, the processor is enabled to perform the precoding matrix index reporting method described in the second aspect.

According to a tenth aspect, an embodiment of this application provides a computer program including an instruction. When the program is run on a processor, the processor is enabled to perform the precoding matrix index reporting method described in the first aspect.

According to an eleventh aspect, an embodiment of this application provides a computer program including an instruction. When the program is run on a processor, the processor is enabled to perform the precoding matrix index reporting method described in the second aspect.

In a possible design, the first communications apparatus may be, but is not limited to, a terminal device. The second communications apparatus may be, but is not limited to, a network device.

In a possible design, the precoding matrix index reporting method may be applied to, but is not limited to, a MIMO system.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic structural diagram of a wireless communications system according to an embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a terminal device according to an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a network device according to an embodiment of the present invention;

FIG. 4 is a schematic flowchart of a precoding matrix index reporting method according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of determining an element location based on a reference location and a window size according to an embodiment of the present invention;

FIG. 6 is another schematic diagram of determining an element location based on a reference location and a window size according to an embodiment of the present invention;

FIG. 7 is another schematic diagram of determining an element location based on a reference location and a window size according to an embodiment of the present invention;

FIG. 8 is another schematic diagram of determining an element location based on a reference location and a window size according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of a reporting manner in which locations are normalized according to an embodiment of the present invention;

FIG. 10 is a schematic diagram of another reporting manner in which locations are normalized according to an embodiment of the present invention;

FIG. 11 is a structural block diagram of a first communications apparatus according to an embodiment of the present invention; and

FIG. 12 is a structural block diagram of a second communications apparatus according to an embodiment of the present invention.

DESCRIPTION OF EMBODIMENTS

To facilitate understanding of embodiments of the present invention, a wireless communications system in the embodiments of the present invention is first described.

FIG. 1 shows a wireless communications system according to an embodiment of the present invention. The wireless communications system 100 may operate in a licensed frequency band, or may operate in an unlicensed frequency band. The wireless communications system 100 is not limited to a long term evolution (LTE) system, and may further be a future evolved 5G system, a new radio (NR) system, or the like. It may be understood that a system capacity of the wireless communications system 100 can be increased by using the unlicensed frequency band. As shown in FIG. 1, the wireless communications system 100 includes one or more network devices 101 and one or more terminal devices 102.

The network device 101 may perform wireless communication with the terminal device 102 by using one or more antennas. Each network device 101 can provide communication coverage for a coverage area 104 corresponding to the network device 101. The coverage area 104 corresponding to the network device 101 may be divided into a plurality of sectors (sector). One sector corresponds to a portion of the coverage area (not shown).

In this embodiment of this application, the network device 101 may include a base transceiver station, a wireless transceiver, a basic service set (BSS), an extended service set (ESS), and a NodeB (Node B), an evolved NodeB (eNB or eNodeB), a next-generation node (gNB), or the like. The wireless communications system 100 may include the network devices 101 of several different types, for example, a macro base station, and a micro base station. The network device 101 may apply different wireless technologies, for example, a cell radio access technology or a WLAN radio access technology.

The terminal devices 102 may be distributed in the entire wireless communications system 100, and may be stationary or mobile. In the embodiments of this application, the terminal devices 102 may include a mobile device, a mobile station (mobile station), a mobile unit (mobile unit), a radio unit, a remote unit, a user agent, a mobile client, and the like.

In this application, the wireless communications system 100 may be a multi-beam communications system.

The network device 101 may have a large-scale antenna array, and control, by using a beamforming technology, the antenna array to form beams of different directions. To cover an entire cell 104, the network device 101 needs to use a plurality of beams of different directions.

For example, in a downlink process, the network device 101 may use beams of different directions in sequence to transmit a radio signal (for example, a downlink reference signal (RS) and/or a downlink synchronization signal block (SS block)), and the process is referred to as beam scanning. In addition, the terminal device 102 measures the transmit beams, to determine signal quality of the transmit beams that can be received by the terminal device 102, and the process is referred to as beam measurement.

In a future communications system, the terminal device 102 may also have an antenna array, and may also change between different beams for signal reception and transmission. In other words, in the wireless communications system 100, both the network device 101 and the terminal device 102 may use a plurality of beams for communication.

In this embodiment of this application, the wireless communications system 100 may support a multi-carrier (waveform signals of different frequencies) operation. A multi-carrier transmitter can simultaneously transmit modulated signals on a plurality of carriers. For example, multi-carrier signals modulated by using different wireless technologies may be carried by each communications connection 103. Each modulated signal can be sent on different carriers, or can carry control information (for example, reference signal information or control channel information), overhead information (Overhead Information), data, or the like.

In this embodiment of this application, the network device 101 sends a channel state information-reference signal (CSI-RS) to the terminal device 102, so that the terminal device 102 measures channel state information (CSI). The CSI includes one or more of a rank indicator (RI), a precoding matrix indicator (PMI), and a channel quality indicator (CQI). The terminal device 102 feeds back the CSI to the network device 101, and the CSI fed back by the terminal device 102 includes one or more of a PIM, an RI, and a CQI. The PMI is used for the network device 101 to determine a precoding matrix. The RI is used to recommend a quantity of layers of data to be sent by the network device 101 to the terminal device 102 on a same time-frequency resource. The CQI assists the network device 101 in determining a modulation and coding scheme, to improve transmission reliability and efficiency. Then, when sending downlink data to the terminal device 102, the network device 101 may perform precoding processing on the downlink data by using the precoding matrix determined based on the PMI or by using a precoding matrix jointly determined based on the PMI and other information. In a two-stage codebook structure, the PMI may be further divided into a PMI 1 and a PMI 2. The PMI 1 is a common parameter, and precoding matrices for data of all layers are the same. The PMI 2 is a non-common parameter, and precoding matrices for data of the layers are different.

FIG. 2 shows a terminal device according to an embodiment of this application. As shown in FIG. 2, the terminal device 200 may include: an input/output module (including an audio input/output module 218, a key input module 216 and a display 220), a user interface 202, one or more processors 204, a transmitter 206, a receiver 208, a coupler 210, an antenna 214, and a memory 212. The components may be connected by using a bus or in another manner. In FIG. 2, the connection by using a bus is used as an example.

The antenna 214 may be configured to: convert electromagnetic energy into an electromagnetic wave in free space, or convert an electromagnetic wave in free space into electromagnetic energy in a transmission line. The coupler 210 is configured to: divide a mobile communications signal received by the antenna 214 into a plurality of multipath signals, and allocate the plurality of multipath signals to a plurality of receivers 208.

The transmitter 206 may be configured to perform transmission processing on a signal output by the processor 204.

The receiver 208 may be configured to perform receiving processing on a mobile communications signal received by the antenna 214.

In this embodiment of this application, the transmitter 206 and the receiver 208 may be considered as a wireless modem. In the terminal device 200, there may be one or more transmitters 206 and one or more receivers 208.

In addition to the transmitter 206 and the receiver 208 shown in FIG. 2, the terminal device 200 may further include another communications component, for example, a GPS module, a Bluetooth module, a wireless high-fidelity (Wi-Fi) module, and the like. In addition to the foregoing wireless communications signal, the terminal device 200 may further support another wireless communications signal, for example, a satellite signal or a shortwave signal. In addition to the wireless communication, the terminal device 200 may further have a wired network interface (for example, a LAN interface) 201 to support wired communication.

The input/output module may be configured to implement interaction between the terminal device 200 and a user/an external environment, and may mainly include the audio input/output module 218, the key input module 216, the display 220, or the like. Specifically, the input/output module may further include: a camera, a touchscreen, a sensor, or the like. All the input and output modules communicate with the processor 204 by using the user interface 202.

The memory 212 is coupled to the processor 204, and is configured to store various software programs and/or a plurality of groups of instructions. Specifically, the memory 212 may include a high-speed random access memory, and may also include a nonvolatile memory, for example, one or more magnetic disk storage devices, a flash memory device, or another nonvolatile solid-state storage device. The memory 212 may store an operating system (briefly referred to as a system below), for example, an embedded operating system such as Android, IOS, WINDOWS, or LINUX. The memory 212 may further store a network communications program. The network communications program may be used to communicate with one or more adjuncts, one or more terminal devices, or one or more network devices. The memory 212 may further store a user interface program, and the user interface program may visually and vividly display content of an application program by using a graphical operation interface, and receive a control operation of the user on the application program by using input controls such as a menu, a dialog box, and a key.

In this embodiment of this application, the memory 212 may be configured to store an implementation program of a precoding matrix index reporting method provided in one or more embodiments of this application on the terminal device 200 side. For implementation of the precoding matrix index reporting method provided in the one or more embodiments of this application, refer to a subsequent embodiment.

The processor 204 may be configured to read and execute a computer-readable instruction. Specifically, the processor 204 may be configured to: invoke a program stored in the memory 212, for example, the implementation program of the system message receiving method provided in one or more embodiments of this application on the terminal device 200 side, and execute an instruction included in the program, to implement the method in the subsequent embodiment. The processor 204 may support one or more of global system for mobile communications (GSM) (2G) communication, wideband code division multiple access (WCDMA) (3G) communication, long term evolution (4G) communication, 5G communication, and the like. Optionally, when the processor 204 sends any message or data, the processor 204 performs the sending specifically by driving or controlling the transmitter 206. Optionally, when the processor 204 receives any message or data, the processor 204 performs the reception specifically by driving or controlling the receiver 208. Therefore, the processor 204 may be considered as a control center for performing sending or reception, and the transmitter 206 and the receiver 208 are specific executors of sending and reception operations.

It may be understood that, the terminal device 200 may be the terminal device 102 in the wireless communications system 100 shown in FIG. 1, and may be implemented as a mobile device, a mobile station (mobile station), a mobile unit (mobile unit), a radio unit, a remote unit, a user agent, a mobile client, or the like.

It should be noted that the terminal device 200 shown in FIG. 2 is merely an implementation of this embodiment of this application. In an actual application, the terminal device 200 may further include more or fewer components. This is not limited herein.

FIG. 3 shows a network device according to an embodiment of this application. As shown in FIG. 3, the network device 300 may include: one or more processors 301, a memory 302, a network interface 303, a transmitter 305, a receiver 306, a coupler 307, and an antenna 308. The components may be connected by using a bus 304 or in another manner. In FIG. 3, the connection by using a bus is used as an example.

The network interface 303 may be configured for the network device 300 to communicate with another communications device, for example, another network device. Specifically, the network interface 303 may be a wired interface.

The transmitter 305 may be configured to perform transmission processing on a signal output by the processor 301, for example, signal modulation. The receiver 306 may be configured to perform receiving processing on a mobile communications signal received by the antenna 308, for example, signal demodulation. In some embodiments of this application, the transmitter 305 and the receiver 306 may be considered as a wireless modem. In the network device 300, there may be one or more transmitters 305 and one or more receivers 306. The antenna 308 may be configured to: convert electromagnetic energy in a transmission line into an electromagnetic wave in free space, or convert an electromagnetic wave in free space into electromagnetic energy in a transmission line. The coupler 307 may be configured to: divide a mobile communications signal into a plurality of multipath signals, and allocate the plurality of multipath signals to a plurality of receivers 306.

The memory 302 is coupled to the processor 301, and is configured to store various software programs and/or a plurality of groups of instructions. Specifically, the memory 302 may include a high-speed random access memory, and may also include a nonvolatile memory, for example, one or more magnetic disk storage devices, a flash memory device, or another nonvolatile solid-state storage device. The memory 302 may store an operating system (briefly referred to as a system below), for example, an embedded operating system such as uCOS, VxWorks, or RTLinux. The memory 302 may further store a network communications program. The network communications program may be used to communicate with one or more adjuncts, one or more terminal devices, or one or more network devices.

The processor 301 may be configured to: perform radio channel management, calling implementation, and communications link establishment and disconnecting, and provide cell handover control and the like for a user in a local control area. Specifically, the processor 301 may include: an administration module/communication module (AM/CM) (configured as a center of speech channel switching and information exchange), a basic module (BM) (configured to complete functions of call processing, signaling processing, radio resource management, radio link management, and circuit maintenance), a transcoder and submultiplexer (TCSM) (configured to complete functions of multiplexing, demultiplexing, and transcoding), or the like.

In this embodiment of this application, the processor 301 may be configured to read and execute a computer-readable instruction. Specifically, the processor 301 may be configured to: invoke a program stored in the memory 302, for example, an implementation program of a precoding matrix index reporting method provided in one or more embodiments of this application on the network device 300 side, and execute an instruction included in the program.

It may be understood that, the network device 300 may be the network device 101 in the wireless communications system 100 shown in FIG. 1, and may be implemented as a base transceiver station, a wireless transceiver, a basic service set (BSS), an extended service set (ESS), a NodeB, an eNodeB, a gNB, or the like.

It should be noted that the network device 300 shown in FIG. 3 is merely an implementation of this embodiment of this application. In an actual application, the network device 300 may further include more or fewer components. This is not limited herein.

It should be noted that a first communications apparatus described in the following embodiments may include, but is not limited to, the foregoing terminal device, and a second communications apparatus may include, but is not limited to, the foregoing network device.

Based on the embodiments respectively corresponding to the foregoing wireless communications system 100, the terminal device 200, and the network device 300, an embodiment of this application provides a precoding matrix index reporting method. The method includes, but is not limited to, the following steps.

S401: A first communications apparatus determines a rank indicator RI and a precoding matrix indicator PMI.

In this embodiment of the present invention, the first communications apparatus includes, but is not limited to, a terminal device.

Specifically, the first communications apparatus generates bit sequences corresponding to the RI and the PMI.

The PMI is used to determine R precoding matrices W₁, . . . , W_(R), and an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies W_(r)W₁×W_(2,r), and r∈{1, . . . , R}. For a specific manner of determining the precoding matrices W₁, . . . , W_(R) based on the PMI, refer to the description in the foregoing summary part. Details are not described herein again.

Herein, R represents a quantity of layers of data that is recommended by the first communications apparatus and that is transmitted by the second communications apparatus to the first communications apparatus on a same time-frequency resource. R is determined by the RI, the RI is a non-negative integer, and R is a positive integer. The RI may be set from 0, and in this case, R=RI+1. For example, when RI=0 and R=1, it indicates that one layer of data is transmitted; and when RI=1 and R=2, it indicates that two layers of data are transmitted. For a specific determining manner, refer to the foregoing Table 1, Table 2, Table 3, or Table 4. Details are not described herein again.

W₁ is a matrix of N rows and 2L columns. Optionally, N is a quantity of ports of the second communications apparatus, L is a quantity of beams included in the W₁ matrix, and both N and L are positive integers. Optionally, N may be a value in a set {4, 8, 12, 16, 24, 32}. For the W₁ matrix, refer to the following formula 1-1.

$\begin{matrix} {{W_{1} = {\begin{bmatrix} X & 0 \\ 0 & X \end{bmatrix} \in C^{N \times 2L}}},} & \left( {1\text{-}1} \right) \end{matrix}$ where

the W₁ matrix is a matrix of N rows and 2L columns X=[b_(k) ₀ . . . b_(k) _(L-1) ] in the W₁ matrix is a matrix of N/2 rows and L columns, and each b_(k) _(i) (0≤i≤L−1) belongs to a vector set B={b₀, b₁, . . . b_(M-1)} Herein, M is a positive integer, and M is greater than or equal to L. Therefore, for an expression of the W₁ matrix, refer to the following formula 1-2.

$\begin{matrix} {W_{1} = \begin{bmatrix} b_{k_{0}} & \ldots & b_{k_{L - 1}} & \; & 0 & \; \\ \; & 0 & \; & b_{k_{0}} & \ldots & b_{k_{L - 1}} \end{bmatrix}} & \left( {1\text{-}2} \right) \end{matrix}$

Optionally, a vector in the vector set B is a discrete Fourier (DFT) vector.

The PMI includes third indication information, and the third indication information is used to indicate the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) .

Optionally, the first communications apparatus and the second communications apparatus prestore each vector in the set B and a mapping relationship between each vector and the PMI, and perform mapping based on values of some parameters in the PMI, to determine the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) , and further determine the W₁ matrix. Alternatively, a generation formula of each vector in the set B is predefined (for example, a table is predefined, and vectors in the set B may be generated by the table based on related parameters), and the first communications apparatus and the second communications apparatus obtain the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) through calculation based on values of some parameters in the PMI, to further determine the W₁ matrix.

Specifically, the second communications apparatus sends a channel state information-reference signal CSI-RS, so that the first communications apparatus measures channel state information CSI. The CSI includes one or more of an RI, a PMI, and a CQI. In a two-stage codebook structure, the PMI includes a PMI 1 and a PMI 2, and is used to recommend a precoding matrix used when the second communications apparatus transmits data to the first communications apparatus. Because a channel has a frequency selection characteristic, precoding matrices indicated by PMIs are different at different frequency domain granularities in CSI feedback bandwidth. Optionally, the frequency domain granularity may be one resource block (RB), one subband (where one subband includes a plurality of consecutive RBs), or one resource block group (RBG, where one RBG includes a plurality of consecutive RBs).

Optionally, a precoding matrix at an f^(th) frequency domain granularity may be transmit-end eigenvectors of a downlink channel matrix H_(f) from the second communications apparatus to the first communications apparatus at the frequency domain granularity, that is, RI eigenvectors obtained by performing eigenvalue decomposition on H_(f) ^(H)H_(f), where f=1, . . . , F. Optionally, the precoding matrix at the f^(th) frequency domain granularity may be obtained by transforming the transmit-end eigenvectors of the downlink channel matrix H_(f) from the second communications apparatus to the first communications apparatus at the frequency domain granularity. For example, the precoding matrix at the frequency domain granularity is obtained based on a plurality of transmit-end eigenvectors of the first communications apparatuses (the precoding matrix may be obtained based on a minimum mean square error criterion, a zero forcing criterion, or another criterion). F is determined based on a quantity of frequency domain granularities of CSI feedback bandwidth of a first communications device and a second communications device. To represent R eigenvectors on an f^(th) RB, the first communications apparatus first selects L beam vectors b_(k) ₀ . . . b_(K) _(L-1) to form the W₁ matrix. The L beam vectors may be orthogonal beam vectors, or may alternatively be non-orthogonal beam vectors. Therefore, the PMI 1 is used to indicate the L beam vectors b_(k) ₀ . . . b_(K) _(L-1) selected by the first communications apparatus. Selection of the L beams is the same for all frequency domain granularities in the CSI feedback bandwidth, and is also the same for all RI eigenvectors.

Optionally, based on the selected W₁, the first communications apparatus performs eigenvalue decomposition on R_(f)=H_(f)W₁)^(H)(H_(f)W₁)∈C^(2L×2L), and selects R eigenvectors from the eigenvalues to form the following 1-3 matrix:

$\begin{matrix} {{{\overset{\_}{W}}_{2,f} = \begin{bmatrix} {\overset{\_}{w}}_{0,1,f} & \ldots & {\overset{\_}{w}}_{0,R,f} \\ \ldots & \ldots & \ldots \\ {\overset{\_}{w}}_{{{2L} - 1},1,f} & \ldots & {\overset{\_}{w}}_{{{2L} - 1},R,f} \end{bmatrix}},} & \left( {1\text{-}3} \right) \end{matrix}$ where

an r^(th) column of W _(2,f) is an r^(th) eigenvector of R_(f), and w _(j,r,f)(r=1, . . . , R; j=0, . . . , 2L−1) is a coefficient of a matrix W _(2,f) in an r^(th) column and a (j+1)^(th) row, where the coefficient is a complex number, and includes an amplitude and a phase.

Optionally, after statistics collection, the first communications apparatus selects and reports a reference location i_(r) (reporting of i_(r) may be performed in the PMI 1 or the PMI 2) of a frequency domain coefficient for each column of W _(2,f), and all other 2L−1 coefficients in the column are normalized by using a coefficient at the coefficient reference location as a reference: w_(j,r,f)=w _(j,r,f)/w _(i,r,f), to obtain a normalized W_(2,f) matrix:

$\begin{matrix} {W_{2,f} = \begin{bmatrix} w_{0,1,f} & \ldots & w_{0,R,f} \\ \ldots & \ldots & \ldots \\ w_{{{2L} - 1},1,f} & \ldots & w_{{{2L} - 1},R,f} \end{bmatrix}} & \left( {1\text{-}4} \right) \end{matrix}$

Optionally, the reference location of the frequency domain coefficient of each column may be on a row on which a coefficient with a maximum wideband amplitude in the column of coefficients is located. A wideband amplitude of a coefficient may be obtained by performing an average calculation, a square average calculation, or other operation on amplitudes that are obtained through statistics collection and that are of the coefficient at all F frequency domain granularities. Optionally, the reference location of the frequency domain coefficient of each column may alternatively be a coefficient location of a fixed row (for example, the first row) in the column. The foregoing method for selecting the reference location of the frequency domain coefficient is not limited in the solution of the present invention.

Optionally, the first communications apparatus does not perform the foregoing normalization operation on each column of W _(2,f) and directly obtains a W_(2,f) matrix, that is, W_(2,f)=W _(2,f). There may be another solution for obtaining W_(2,f) by using W _(2,f). This is not limited in the solution of the present invention.

After the W_(2,f) matrix is determined, for an element w_(j,r,f) (r=1, . . . , R; and j=0, . . . , 2L−1) in the r^(th) column and the (j+1)^(th) row of the matrix, values of the element at all the F frequency domain granularities are combined in series to form a vector [w_(j,r,1), . . . , w_(j,r,F)], to form the following W_(2,r) matrix shown in formula 1-4a:

$\begin{matrix} {W_{2,r} = \begin{bmatrix} w_{0,r,1} & \ldots & w_{0,r,F} \\ \ldots & \ldots & \ldots \\ w_{{{2L} - 1},r,1} & \ldots & w_{{{2L} - 1},r,F} \end{bmatrix}} & \left( {1\text{-}4a} \right) \end{matrix}$

In this case, the matrix W₁ and an f^(th) (f=1, . . . , F) column of the matrix W_(2,r) constitute a precoding vector of an r^(th) layer of data at the f^(th) frequency domain granularity, that is, W_(r)(f)=W₁×W_(2,r)(f), where X(f) represents extracting an f^(th) column of a matrix X. Therefore, an expression W_(r)=W₁×W_(2,r) is used. At a same frequency domain granularity f, precoding matrices: [W₁(f), . . . , W_(R)(f)] of all layers at the frequency domain granularity may also be obtained by splicing precoding vectors W_(r)(f) of data of the layers.

After the vector [W_(j,r,1), . . . , w_(j,r,F)] is determined, the first communications apparatus performs an IDFT (or inverse fast Fourier transform, IFFT) operation on the vector, to obtain a corresponding time-domain signal vector [a_(r,j,1), . . . , a_(r,J,T)] (T is greater than or equal to F and is a minimum value of 2 raised to the power, and F is a positive integer), and the vector [_(r,j,1), . . . , a_(r,j,T)] is used as the (j+1)^(th) row of the V_(2,r) matrix, to obtain the time domain V_(2,r) matrix corresponding to an r^(th) column of the W_(2,f) matrix. Refer to the following formulas 1-5:

$\begin{matrix} {{V_{2,r} = \begin{bmatrix} a_{r,0,1} & \ldots & a_{r,0,T} \\ \ldots & \ldots & \ldots \\ a_{r,{{2L} - 1},1} & \ldots & a_{r,{{2L} - 1},T} \end{bmatrix}},} & \left( {1\text{-}5} \right) \end{matrix}$ where

V_(2,r) is a matrix of 2L rows and T columns. It can be learned from the foregoing transform relationship that DFT transform is performed on an l_(th) row of V_(2,r) to obtain an l_(th) row of W_(2,r), and l∈{1, . . . , 2L}. Herein, the DFT transform may be completed by performing a DFT operation, or may be obtained by performing mathematical transform by multiplying a DFT matrix. Optionally, the DFT transform may alternatively be FFT transform.

The PMI includes first indication information and second indication information, the first indication information includes location index information, and the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . , T} on an m^(th) row of V_(2,r). Herein, the element locations may be understood as time domain tap locations, and coefficients at the element locations are non-zero or greater than or equal to a predetermined value. An element on the m^(th) row of V_(2,r) at a location other than the element locations takes a predefined value (for example, 0). A quantity K_(m,r) of the element locations may be a predefined value, or may be configured by the second communications apparatus for the first communications apparatus, or may be reported by the first communications apparatus. K_(m,r) is a positive integer, and K_(m,r) is less than T.

In a possible implementation, RI≥2, and for the m^(th) row, the location index information indicates a group of locations c_(m,1), . . . , c_(m,K) _(m) , and the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate K_(m,r) element locations on an m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R), that is, t_(r,m,i)=c_(m,i) and K_(m,r)=K_(m), where m∈{1, . . . , 2L} and i∈{1, . . . , K_(m)}. In other words, when the element locations on the m^(th) row of the V_(2,r) matrix are reported, for the m^(th) row of all the R V_(2,r) matrices, only one group of locations may be reported, that is, values of the reported K_(m,r) element locations for different values of r are the same. As compared with a manner in which a group of locations on the m^(th) row of each V_(2,r) matrix is separately reported, feedback overheads of the PMI are reduced. For precoding matrices at different layers, locations of channel time-domain multipaths corresponding to a same beam (that is, a same row of the R matrices) are very close. Therefore, a method for reporting a group of locations for values on a same row of all the R matrices causes a relatively small performance loss. However, feedback overheads of the PMI can be greatly reduced.

Optionally, the location index information includes indication information of M_(m) reference locations (d_(m,1), . . . d_(m,M) _(m) ). The indication information of the M_(m) reference locations (d_(m,1), . . . , d_(m,M) _(m) ) is used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) , and M_(m) is a positive integer less than T.

Optionally, for the m^(th) row, the location index information further includes a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location d_(m,n) in the M_(m) reference locations, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer. Alternatively, a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location d_(m,n) in the M_(m) reference locations is configured by using first configuration information, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer. In this case, the M_(m) window sizes may be configured by the second communications apparatus for the first communications apparatus by using configuration information.

There are a plurality of methods for determining the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) , based on the M_(m) window sizes X_(m,n) and the M_(m) reference locations. M_(m)=1 is used as an example. Optionally, as shown in FIG. 5, X_(m,n) locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, and the X_(m,n) locations are included in the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . In this case, 1+X_(m,n)=K_(m). Optionally, referring to FIG. 6, X_(m,n)−1 locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, and the X_(m,n) locations are the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . In this case, X_(m,n)=K_(m). Similar to the foregoing two methods, X_(m,n) locations starting from a reference location may alternatively be counted along a direction in which a column number of the matrix V_(2,r) decreases. Details are not described again. Optionally, as shown in FIG. 7, a reference location is used as a central location, X_(m,n) locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the 2X_(m,n)+1 locations are the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . Optionally, as shown in FIG. 8, a reference location is used as a central location, X_(m,n)/2 locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the X_(m,n)+1 locations are the K_(m) locations c_(m,1), . . . , c_(m,K) _(m) . There may be another determining manner. This is not excluded herein.

Optionally, when a quantity M_(m) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the M_(m) reference locations; and relative location information that is of each of M_(m)−1 reference locations, other than the first reference location, in the M_(m) reference locations and that is relative to the first reference location. During implementation of this embodiment of the present invention, due to a time domain characteristic of a channel, that is, delays of a plurality of sub-paths of the channel in time domain are usually relatively centralized, a value interval of relative location information of the M_(m)−1 elements is far less than a value interval of absolute location information. Therefore, a quantity of quantization bits of quantized location information can be reduced in a manner of reporting the relative location information, thereby reducing feedback overheads of the PMI. For example, if there are a total of 64 sampling points in time domain in terms of multipath delays of a channel, it indicates that one piece of absolute location information of the element needs to be represented by using 6 bits. When values of the multipath delays of the channel are relatively centralized, for example, the multipath delays of the channel are all within 16 sampling points after the first absolute location, each piece of relative location information of the element needs to be represented by using 4 bits. Therefore, feedback overheads of the PMI can be reduced by reporting the relative location information.

Optionally, the location index information further includes G_(m) groups of fourth indication information, and an n^(th) (1≤n≤G_(m)) group of fourth indication information is used to indicate Z_(m,n) element locations selected from Y_(m,n) element locations, where the Y_(m,n) element locations are determined based on an n^(th) reference location in the G_(m) reference locations and a window size X_(m,n) associated with the n^(th) reference location, Z_(m,n) is a positive integer less than or equal to Y_(m,n), and the G_(m) reference locations, the G_(m) window sizes, and the G_(m) pieces of fourth indication information are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) . In this case, when not all element locations in a time domain window are selected as K_(m,r) element locations t_(r,m,1), . . . t_(r,m,K) _(m,r) , actually selected K_(m,r) element locations t_(r,m,1), . . . t_(r,m,K) _(m,r) need to be additionally reported.

In another possible implementation, R≥1, and the location index information indicates R groups of locations, where an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is n∈{1, . . . , 2L} m∈{1, . . . , 2L} and n≠m, and it satisfies that t_(r,m,i)=t_(r,n,i)=c_(r,i), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , K_(r)}, and r∈{1, . . . , R}. For at least two rows in each of the R matrices V_(2,1), . . . , V_(2,R), only one group of locations may be reported. As compared with a manner in which a group of locations on each row of the matrix V_(2,r) is separately reported, feedback overheads of the PMI are reduced. Further, optionally, for 2L−1 rows of an r^(th) V_(2,r) matrix, only one group of locations is reported, that is t_(r,m,1)=c_(r,K) _(r) , and K_(m,r)=K_(r). As compared with a manner in which a group of locations on each row of the matrix V_(2,r) at each of R layers is separately reported, feedback overheads of the PMI are reduced. When multipaths of channels between the first communications apparatus and the second communications apparatus are extremely centralized, element locations corresponding to beams are very close. Therefore, only one group of locations is reported for at least two rows, so that a performance loss caused is small, but reporting overheads are reduced.

Optionally, the two rows in at least two rows of each matrix may be different two rows in the R matrices. For example, in the matrix V_(2,1), a reported group of locations indicates element locations on an (n1)^(th) row and an (m1)^(th) row; and in the matrix V_(2,2), a reported group of locations indicates element locations on an (n2)^(th) row and an (m2)^(th) row. Optionally, the two rows may be the same two rows in the R matrices. During implementation of this embodiment of the present invention, for at least two rows in each of the R matrices V_(2,1), . . . , V_(2,R), only one group of locations may be reported. As compared with a manner in which a group of locations on each row of the matrix V_(2,r) is separately reported, feedback overheads of the PMI are reduced. Further, optionally, for 2L−1 rows of an r^(th) V_(2,r) matrix, only one group of locations is reported, that is, t_(r,m,i)=c_(r,K) _(r) , and K_(m,r)=K_(r), so that feedback overheads of the PMI can be further reduced. Similarly, the 2L−1 rows may be different 2L−1 rows in the R matrices, or may be the same 2L−1 rows.

Optionally, the location index information includes indication information of M_(r) reference locations (d_(r,1), . . . , d_(r,M) _(r) ). The indication information of the M_(r) reference locations (d_(r,1), . . . , d_(r,M) _(r) ) is used to indicate an r^(th) group of locations c_(r,1), . . . , c_(r,M) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.

Optionally, the location index information further includes a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location d_(r,n) in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,M) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location d_(r,n) in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,M) _(r) in the R groups of locations, and X_(r,n) is a positive integer. In this case, the M_(r) window sizes may be configured by the second communications apparatus for the first communications apparatus by using configuration information.

There are a plurality of methods for determining the K_(r) locations c_(r,1), . . . , c_(r,M) _(r) based on the M_(r) window sizes X_(r,n) and the M_(r) reference locations. M_(r)=1 is used as an example. Optionally, X_(r,n) locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, where the X_(r,n) locations are included in the K_(r) locations c_(r,1), . . . , c_(r,M) _(r) . In this case, 1+X_(r,n)=K_(r). Optionally, X_(r,n)−1 locations starting from a reference location (including the reference location) are counted along a direction in which a column number of the matrix V_(2,r) increases, and the X_(r,n) locations are the K_(r) locations c_(r,1), . . . , c_(r,M) _(r) . In this case, X_(r,n)=K_(r). Similar to the foregoing two methods, X_(r,n) locations starting from a reference location may alternatively be counted along a direction in which a column number of the matrix V_(2,r) decreases. Details are not described again. Optionally, a reference location is used as a central location, X_(r,n) locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the 2X_(r,n)+1 locations are the K_(r) locations c_(r,1), . . . , c_(r,M) _(r) . Optionally, a reference location is used as a central location, X_(r,n)/2 locations are counted respectively along a direction in which a column number of the matrix V_(2,r) decreases and along a direction in which a column number of the matrix V_(2,r) increases, and the X_(r,n)+1 locations are the K_(r) locations c_(r,1), . . . , c_(r,M) _(r) . There may be another determining manner. This is not excluded herein. For a specific calculation manner, refer to the calculation manners shown in FIG. 5 to FIG. 8. Details are not described herein again.

Optionally, a value of the window size X_(m,n) or X_(r,n) may be predefined, configured by the second communications apparatus, or reported by the first communications apparatus. In this embodiment of the present invention, the window size is used to represent a length of a time domain window including a plurality of element locations.

When a quantity M_(r) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the M_(r) reference locations, and relative location information that is of each of M_(r)−1 reference locations, other than the first reference location, in the M_(r) reference locations and that is relative to the first reference location. For meanings of the absolute location information and the relative location information, refer to the foregoing summary part. Details are not described again. During implementation of this embodiment of the present invention, due to a time domain characteristic of a channel, that is, delays of a plurality of sub-paths of the channel in time domain are usually relatively centralized, a value interval of relative location information of the M_(r)−1 elements is far less than a value interval of absolute location information. Therefore, a quantity of quantization bits of quantized location information can be reduced in a manner of reporting the relative location information, thereby reducing feedback overheads of the PMI. For example, if there are a total of 64 sampling points in time domain in terms of multipath delays of a channel, it indicates that one piece of absolute location information of the element needs to be represented by using 6 bits. When values of the multipath delays of the channel are relatively centralized, for example, the multipath delays of the channel are all within 16 sampling points after the first absolute location, each piece of relative location information of the element needs to be represented by using 4 bits. Therefore, feedback overheads of the PMI can be reduced by reporting the relative location information.

With reference to the first aspect or the second aspect, in a possible design, the location index information further includes G_(r) groups of fourth indication information, and an n^(th) (1≤n≤G_(r)) group of fourth indication information is used to indicate Z_(r,n) element locations selected from γ_(r,n) element locations, where the γ_(r,n) element locations are determined based on an n^(th) reference location in the G_(r) reference locations and a window size X_(r,n) associated with the n^(th) reference location, Z_(r,n) is a positive integer less than or equal to γ_(r,n), and the G_(r) reference locations, the G_(r) window sizes, and the G_(r) pieces of fourth indication information are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,M) _(r) in the R groups of locations. In this case, when not all element locations in a time domain window are selected as K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) , actually selected K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) need to be additionally reported.

When M_(m)>1 or M_(r)>1, reporting manners of the M_(m) or M_(r) reference locations include, but are not limited to, the following two manners. A first reporting manner is that: The M_(m) or M_(r) reference locations are reported in an independent reporting manner, that is, absolute values at 1 to T (or 0 to T−1) are separately reported for each reference location. Optionally, a quantity of quantization bits of each absolute value is ┌log₂(T)┐ bits. A second reporting manner is that: The M_(m) or M_(r) reference locations may be reported in a relative location reporting manner, that is, an absolute value is reported for one (or a predefined location) of the M_(m) or M_(r) reference locations, and relative location information relative to the one (or the predefined location) reference location is reported for other M_(m)−1 or M_(n)−1 reference locations. Optionally, a quantity of quantization bits of the absolute value is ┌log₂(T)┐ bits, and a quantity of quantization bits of the relative location is ┌log₂(T₀)┐ bits, where ┌log₂T┐>┌log₂ T₀┐. An advantage of the second reporting manner is as follows: When locations of time domain windows are very close, a quantity of bits required for reporting the relative location information is less than a quantity of bits required for reporting the absolute location information, so that reporting overheads can be reduced. Optionally, the relative location information may be a relative value calculated in a manner of calculating a difference, calculating a quotient, or the like.

After K_(m,r) element locations of each row are determined, a coefficient at each element location further needs to be indicated. The coefficient herein is a complex coefficient, and includes a coefficient amplitude and a coefficient phase. The second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), and V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m,r)}.

In a possible implementation, the first indication information further includes indication information of |A| first element locations τ_(r,m) and one second element location γ_(r) of V_(2,r), m∈A, the set A is a non-empty subset of a set {1, . . . , 2L}, |A| represents a quantity of elements in the set A, and r∈{1, . . . , R}. τ_(r,m) is an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,i) | in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) , and the second element location γ_(r) is an element location with a maximum coefficient amplitude |a_(r,m,τ) _(r,m) | in the |A| first element locations τ_(r,m). The second indication information includes relative values of all or some coefficients a_(r,m,t) _(r,m,j) at K_(m,r)−1 element locations, other than the first element location τ_(r,m), in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) and a coefficient a_(r,m,τ) _(r,m) at the first element location τ_(r,m). Herein, the relative values may be a quantized value of a difference or a quotient, for example, a quantized value of a_(r,m,t) _(r,m,j) /a_(r,m,τ) _(r,m) , a quantized value of a_(r,m,t) _(r,m,j) /a_(r,m,τ) _(r,m) , a quantized value of a_(r,m,t) _(r,m,j−) a_(r,m,τ) _(r,m) , or a quantized value of a_(r,m,t) _(r,m,j) −a_(r,m,τ) _(r,m) . The second indication information further includes relative values of coefficients a_(r,m,τ) _(r,m) at |A|−1 first element locations, other than the second element location γ_(r), in the |A| first element locations τ_(r,m) and a coefficient a_(r,mγ) _(r) at the second element location γ_(r). Herein, the relative value may be a difference or a quotient, for example, a quantized value of a_(r,m,τ) _(r,m,) /a_(r,m,γ) _(r) , a quantized value of a_(r,m,γ) _(r) /a_(r,m,τ) _(r,m) , a quantized value of a_(r,m,τ) _(r,m−) a_(r,m,γ) _(r) , or a quantized value of a_(r,mγ) _(r−) a_(r,m,τ) _(r,m) . In another possible implementation, the first indication information includes a third element location γ_(r) of V_(2,r), and γ_(r) is used to indicate an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,j) | at element locations

$\bigcup\limits_{m \in A}{\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}.}$ The second indication information includes relative values of all or some coefficients at element locations

${\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}},$ other than the third element location γ_(r), in all the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ and a coefficient at the location γ_(r), and

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ is a set obtained by obtaining a union set of sets {t_(r,m,1), . . . , t_(r,m,K) _(m) } corresponding to all elements m that belong to the set A. For example,

${\bigcup\limits_{m \in {\{{1,2}\}}}\left\{ {a_{m,1},a_{m,2}} \right\}} = {\left\{ {a_{1,1},a_{1,2},a_{2,1},a_{2,2}} \right\}.}$ Herein, the relative value may be a difference or a quotient.

For example, as shown in FIG. 9 (an example in which K_(m,r) element locations selected for all rows are the same is used), each grid in FIG. 9 represents an element at a selected element location. The first indication information separately indicates corresponding element locations on 2L−1 rows, and indicates element locations τ_(r,m) (a location 1, a location 2, and a location 3 in the figure) with maximum coefficient amplitudes at K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) corresponding to the m^(th) row. The second indication information indicates a quantized value (shown by a dashed line in the figure) of a normalized value a_(r,m,t) _(r,m,j) /a_(r,m,τ) _(r,m) that is of all or some coefficients at locations, other than τ_(r,m), in t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the row and that is relative to a coefficient at the location τ_(r,m). In addition, the first indication information further indicates a location γ_(r) (a location 4 in the figure) corresponding to a maximum coefficient amplitude in 2L−1 τ_(r,m), and the second indication information further indicates a quantized value (shown by a solid line in the figure) of a normalized value a_(r,m,τ) _(r,m) /a_(r,m,γ) _(r) that is of a coefficient at 2L−2 τ_(r,m) locations other than γ_(r) and that is relative to a coefficient at the location γ_(r). In this embodiment, |A|=2L−1 is used as an example for description.

An advantage of the method is that: If an amplitude of a coefficient on a row of the V_(2,r) matrix is relatively small compared with an amplitude of a coefficient on another row, by using the normalization method, not all coefficients on the row need to be normalized and quantized to 0, thereby improving feedback precision of the PMI.

For another example, as shown in FIG. 10 (an example in which K_(m,r) element locations selected for all rows are the same is used), the first indication information separately indicates corresponding element locations on 2L−1 rows, and indicates an element location γ_(r) (a location in the figure) with a maximum coefficient amplitude at Km,r element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) corresponding to all the 2L−1 rows, and a quantized value (shown by a solid line in the figure) of a normalized value that is of all or some coefficients at locations, other than γ_(r), in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) of all the rows and that is relative to a coefficient at the location γ_(r). An advantage of the method is that: Feedback precision of a PMI of a beam with relatively strong energy can be higher.

Different quantization methods may be used to quantize relative values of coefficients.

In a possible implementation, quantities of quantization bits of at least two relative values in the relative values that are of the coefficients and that are included in the second indication information are different. For example, among all relative values that are of coefficients and that are included in the second indication information, sorting is performed based on amplitudes of the relative values, and a quantity of quantization bits used for relative values of P coefficients with maximum amplitude values is greater than a quantity of quantization bits used for relative values of other coefficients. The quantity of quantization bits herein used for comparison may be a quantity of quantization bits of amplitudes and/or a quantity of quantization bits of phases. An advantage of the method is that: When reporting overheads of a PMI are the same, quantization precision of a relative value of a coefficient with a relatively large amplitude is improved, and quantization precision of a relative value of a coefficient with a relatively small amplitude is reduced, so that overall feedback precision of the entire PMI can be improved.

Further, in a possible implementation, for an m^(th) row and an n^(th) row (m is not equal to n) of a matrix V_(2,r), a reported quantity of quantization bits of a relative value of a coefficient at the K_(m,r)−1 element locations is greater than a quantity of quantization bits of a relative value of a coefficient at the K_(n,r)−1 element locations. The quantity of quantization bits herein used for comparison may be a quantity of quantization bits of amplitudes and/or a quantity of quantization bits of phases. An advantage of the method is that: When reporting overheads of a PMI are the same, quantization precision of a relative value of a coefficient corresponding to a vector with relatively strong energy in L vectors of W₁ is improved, and quantization precision of a relative value of a coefficient corresponding to a vector with relatively weak energy is reduced, so that overall feedback precision of the entire PMI can be improved.

Further, in another possible implementation, for a matrix V_(2,r), quantities of quantization bits of at least two relative values in relative values of coefficients at locations, other than the third element location γ_(r), in the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ are different. For example, the first communications apparatus may sort the relative values based on amplitudes of the relative values, and a quantity of quantization bits used for relative values of P coefficients with maximum amplitude values is greater than a quantity of quantization bits used for relative values of other coefficients. The quantity of quantization bits herein used for comparison may be a quantity of quantization bits of amplitudes and/or a quantity of quantization bits of phases. An advantage of the method is that: When reporting overheads of a PMI are the same, quantization precision of a relative value of a coefficient with a relatively large amplitude is improved, and quantization precision of a relative value of a coefficient with a relatively small amplitude is reduced, so that overall feedback precision of the entire PMI can be improved.

S402: The first communications apparatus sends the rank indicator RI and the precoding matrix indicator PMI.

S403: The second communications apparatus receives the rank indicator RI and the precoding matrix indicator PMI, and determines, based on the PMI, a precoding matrix W_(r)=W₁×W_(2,r) on an r^(th) (r=1, . . . , R) layer in R layers.

In this embodiment of the present invention, the first communications apparatus includes, but is not limited to, a network device.

In this embodiment of the present invention, the second communications apparatus restores a time domain matrix V_(2,r) on each layer based on the RI and the PMI that are reported by the first communications apparatus. The second communications apparatus determines R based on the RI. The second communications apparatus performs DFT transform on V_(2,r), to obtain a frequency domain V2 matrix W_(2,r) on each subband or RB. The W1 matrix is obtained with reference to the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) reported by the first communications apparatus. In this case, a precoding matrix on an f^(th) RB/subband is determined based on W1 and the matrix W_(2,r). After the precoding matrix is obtained, when downlink data is sent, precoding processing is performed on the downlink data by using the precoding matrix.

Optionally, the method further includes: The second communications apparatus sends second configuration information; and the first communications device receives the second configuration information, where the second configuration information is used to indicate that: For an m^(th) row, the location index information includes only one group of locations c_(m,1), . . . , c_(m,K) _(m) , and the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate same K_(m,r) element locations on the m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R). Alternatively, that the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate same K_(m,r) element locations on the m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R) may alternatively be specified in a protocol.

Optionally, the method further includes: The second communications apparatus sends third configuration information, and the first communications device receives the third configuration information, where the third configuration information is used to indicate that the location index information includes only R groups of locations, and an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) is used to indicate same K_(m,r) element locations on at least two rows in V_(2,r). Alternatively, that an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) is used to indicate same K_(m,r) element locations of at least two rows in V_(2,r) may alternatively be specified in a protocol.

During implementation of this embodiment of the present invention, when the precoding matrix index is reported, only some element locations and coefficient amplitudes and coefficient phases at some element locations may be reported, so that feedback overheads of the PMI can be reduced. When a plurality of element locations are reported, the locations may be reported in a location normalization manner, thereby further reducing feedback overheads of the PMI. When the coefficient amplitude and the coefficient phase are reported, reporting may be performed in a normalized manner, thereby further reducing feedback overheads of the PMI.

FIG. 11 is a structural block diagram of a first communications apparatus according to this application. As shown in FIG. 11, the first communications apparatus 110 may include a determining unit 1101 and a sending unit 1102.

The determining unit 1101 may be configured to determine a rank indicator RI and a precoding matrix indicator PMI. The PMI is used to determine R precoding matrices W₁, . . . , W_(R), and an r^(th) precoding matrix in the R precoding matrices satisfies W_(r)=W₁×W_(2,r), and r∈{1, . . . , R}.

W₁ is a matrix of N rows and 2L columns, W_(2,r) is a matrix of 2L rows and F columns, an l_(th) row of W_(2,r) is obtained by performing DFT transform on an l_(th) row of a matrix V_(2,r), V_(2,r) is a matrix of 2L rows and T columns, R is indicated by the RI, and l∈{1, . . . , 2L}.

The PMI includes first indication information and second indication information, the first indication information includes location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1 . . . T} on an m^(th) row of V_(2,r), the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,j) on the m^(th) row of V_(2,r), V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(m,j) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m,r)}.

The RI is a nonnegative integer, N, L, F, T, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is less than or equal to T.

The sending unit 1102 may be configured to send the RI and the PMI.

Optionally, R≥2, and for the m^(th) row, the location index information indicates a group of locations c_(m,1), . . . , c_(m,K) _(m) , and the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate the K_(m,r) element locations on an m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R), that is, t_(r,m,i)=c_(m,i) and K_(m,r)=K_(m), m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m)}.

Optionally, R≥1, the location index information indicates R groups of locations, an r^(th) group of locations C_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L} and n≠m, and it satisfies that t_(r,m,i)=t_(r,n,i)=c_(r,i)=c_(r,i), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , K_(r)}, and r∈{1, . . . , R}.

Optionally, the location index information includes indication information of M_(m) reference locations, the indication information of the M_(m) reference locations is used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) , and M_(m) is a positive integer less than T.

Optionally, the location index information includes indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.

Optionally, for the m^(th) row, the location index information further includes a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer.

Alternatively, a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations is configured by using first configuration information, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer.

Optionally, the location index information further includes a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.

Alternatively, a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . ,c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.

Optionally, when a quantity G_(m) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the G_(m,r) reference locations, and relative location information that is of each of G_(m,r)−1 reference locations, other than the first reference location, in the G_(m,r) reference locations and that is relative to the first reference location, where G_(m,r)=M_(m) or G_(m,r)=M_(r).

Optionally, when G_(m,r)=M_(m), the location index information further includes G_(m) groups of fourth indication information, and an n^(th) (1≤n≤G_(m)) group of fourth indication information is used to indicate Z_(m,n) element locations selected from Y_(m,n) element locations. The Y_(m,n) element locations are determined based on an n^(th) reference location in the G_(m) reference locations and a window size X_(m,n) associated with the n^(th) reference location, Z_(m,n) is a positive integer less than or equal to Y_(m,n), and the G_(m) reference locations, the G_(m) window sizes, and the G_(m) pieces of fourth indication information are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) .

Alternatively, when G_(m,r)=M_(r), the location index information further includes G_(r) group of fourth indication information, and an n^(th) (1≤n≤G_(r)) group of fourth indication information is used to indicate Z_(r,n) element locations selected from Y_(r,n) element locations. The Y_(r,n) element locations are determined based on an n^(th) reference location in the G_(r) reference locations and a window size X_(r,n) associated with the n^(th) reference location, Z_(r,n) is a positive integer less than or equal to Y_(r,n), and the G_(r) reference locations, the G_(r) window sizes, and the G_(r) pieces of fourth indication information are used to determine the r^(th) group of locations c_(m,1), . . . , c_(m,K) _(m) in the R groups of locations.

Optionally, the first indication information further includes indication information of |A| first element locations τ_(r,m) and one second element location γ_(r) of V_(2,r), m∈A, the set A is a non-empty subset of a set {1, . . . , 2L}, |A| represents a quantity of elements in the set A, and r∈{1, . . . , R}.

τ_(r,m) is an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,j) | in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) , and the second element location γ_(r) is an element location with a maximum coefficient amplitude |a_(r,m,τ) _(r,m) | in the |A| first element locations τ_(r,m).

The second indication information includes relative values of all or some coefficients a_(r,m,t) _(r,m,j) at K_(m,r)−1 element locations, other than the first element location τ_(r,m), in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) and a coefficient a_(r,m,τ) _(r,m) at the first element location τ_(r,m).

The second indication information further includes relative values of coefficients a_(r,m,τ) _(r,m) at |A|−1 first element locations, other than the second element location γ_(r), in the |A| first element locations τ_(r,m) and a coefficient a_(r,m,γ) _(r) at the second element location γ_(r).

Optionally, the first indication information includes a third element location γ_(r) of V_(2,r), and γ_(r) is used to indicate an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,j) | at element locations

$\bigcup\limits_{m \in A}{\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}.}$

The second indication information includes relative values of all or some coefficients at element locations, other than the third element location γ_(r), in all the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ and a coefficient at the location γ_(r).

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ is a set obtained by obtaining a union set of sets {t_(r,m,1), . . . , t_(r,m,K) _(m) } corresponding to all elements m that belong to the set A.

Optionally, quantities of quantization bits of at least two relative values in the relative values that are of the coefficients and that are included in the second indication information are different.

Optionally,

$W_{1} = \begin{bmatrix} X & 0 \\ 0 & X \end{bmatrix}$ is a matrix of N rows and 2L columns, and X=[b_(k) ₀ . . . b_(k) _(L-1) ] is a matrix of N/2 rows and L columns, b_(k) _(i) (0≤i≤L−1) belongs to a vector set B={b₀, b₁, . . . b_(M-1)}, the PMI further includes third indication information, the third indication information is used to indicate the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) , M is a positive integer, and M is greater than or equal to L.

Optionally, V_(2,r)=[V_(2,r,1) . . . V_(2,r,τ)], a t^(th) column in V_(2,r) is V_(2,r,t)=[a_(r,1,t) . . . a_(r,2L,t)]^(T), 1≤t≤T, and [ ]^(T) represents transposing.

It may be understood that, for a specific implementation of the functional units included in the first communications apparatus 110, refer to the foregoing embodiment. Details are not described herein again.

FIG. 12 is a structural block diagram of a second communications apparatus according to this application. As shown in FIG. 12, the second communications apparatus 120 may include a receiving unit 1201 and a determining unit 1202.

The receiving unit 1201 is configured to receive a rank indicator RI and a precoding matrix indicator PMI.

The determining unit 1202 is configured to determine R precoding matrices W₁, . . . , W_(R) based on the PMI, and an r^(th) precoding matrix in the R precoding matrices satisfies W_(r)=W₁×W_(2,r), and r∈{1, . . . , R}.

W₁ is a matrix of N rows and 2L columns, W_(2,r) is a matrix of 2L rows and F columns, an l^(th) row of W_(2,r) is obtained by performing DFT transform on an l_(th) row of a matrix V_(2,r), V_(2,r) is a matrix of 2L rows and T columns, R is indicated by the RI, and l∈{1, . . . , 2L}.

The PMI includes first indication information and second indication information, the first indication information includes location index information, and the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1 . . . , T} on an m^(th) row of V_(2,r), the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,j) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m,r)}.

The RI is a nonnegative integer, N, L, F, T, R, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is less than or equal to T.

Optionally, R≥2, and for the m^(th) row, the location index information indicates a group of locations c_(m,1), . . . , t_(r,m,K) _(m,r) and the group of locations c_(m,1), . . . , c_(m,K) _(m) is used to indicate the K_(m,r) element locations on an m^(th) row of each of the R matrices V_(2,1), . . . , V_(2,R), that is, t_(r,m,i)=c_(m,i) and K_(m,r)=K_(m), m∈{1, . . . , 2L}, i∈{1, . . . , K_(m)}.

Optionally, R≥1, the location index information indicates R groups of locations, an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(r,m,i)=t_(r,n,i)=c_(r,j), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , K_(r)}, and r∈{1, . . . , R}.

Optionally, the location index information includes indication information of M_(m) reference locations, the indication information of the M_(m) reference locations is used to indicate the group of locations c_(m,1), . . . , c_(m,K) _(m) , and M_(m) is a positive integer less than T.

Optionally, the location index information includes indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.

Optionally, for the m^(th) row, the location index information further includes a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) , and X_(m,n) is a positive integer.

Alternatively, a window size X_(m,n) associated with an n^(th) (n=1, . . . , M_(m)) reference location in the M_(m) reference locations is configured by using first configuration information, the M_(m) reference locations and the M_(m) window sizes are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) and X_(m,n) is a positive integer.

Optionally, the location index information further includes a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.

Alternatively, a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.

Optionally, when a quantity G_(m) of the reference locations is greater than 1, the location index information includes absolute location information of one first reference location in the G_(m,r) reference locations, and relative location information that is of each of G_(m,r)−1 reference locations, other than the first reference location, in the G_(m,r) reference locations and that is relative to the first reference location, where G_(m,r) M_(m) or G_(m,r). M_(r).

Optionally, when G_(m,r)M_(m), the location index information further includes G_(m) groups of fourth indication information, and an n^(th) (1≤n≤G_(m)) group of fourth indication information is used to indicate Z_(m,n) element locations selected from Y_(m,n) element locations. The Y_(m,n) element locations are determined based on an n^(th) reference location in the G_(m) reference locations and a window size X_(m,n) associated with the n^(th) reference location, Z_(m,n) is a positive integer less than or equal to Y_(m,n), and the G_(m) reference locations, the G_(m) window sizes, and the G_(m) pieces of fourth indication information are used to determine the group of locations c_(m,1), . . . , c_(m,K) _(m) .

Alternatively, when G_(m,r)M_(r), the location index information further includes G_(r) group of fourth indication information, and an n^(th) (1≤n≤G_(r)) group of fourth indication information is used to indicate Z_(r,n) element locations selected from γ_(r,n) element locations. The γ_(r,n) element locations are determined based on an n^(th) reference location in the G_(r) reference locations and a window size X_(r,n) associated with the n^(th) reference location, Z_(r,n) is a positive integer less than or equal to γ_(r,n), and the G_(r) reference locations, the G_(r) window sizes, and the G_(r) pieces of fourth indication information are used to determine the r^(th) group of locations c_(m,1), . . . , c_(m,K) _(m) in the R groups of locations.

Optionally, the first indication information further includes indication information of |A| first element locations τ_(r,m) and one second element location γ_(r) of V_(2,r), m∈A, the set A is a non-empty subset of a set {1, . . . , 2L}, |A| represents a quantity of elements in the set A, and r∈{1, . . . , R}.

τ_(r,m) is an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,j) | in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) , and the second element location γ_(r) is an element location with a maximum coefficient amplitude |a_(r,m,τ) _(r,m) | in the |A| first element locations τ_(r,m).

The second indication information includes relative values of all or some coefficients a_(r,m,t) _(r,m,j) at K_(m,r)−1 element locations, other than the first element location τ_(r,m), in the K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) and a coefficient a_(r,m,τ) _(r,m) at the first element location γ_(r,m).

The second indication information further includes relative values of coefficients a_(r,m,τ) _(r,m) at |A|−1 first element locations, other than the second element location γ_(r), in the |A| first element locations τ_(r,m) and a coefficient a_(r,m,γ) _(r) at the second element location γ_(r).

Optionally, the first indication information includes a third element location γ_(r) of V_(2,r), and γ_(r) is used to indicate an element location with a maximum coefficient amplitude |a_(r,m,t) _(r,m,j) | at element locations

$\bigcup\limits_{m \in A}{\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}.}$

The second indication information includes relative values of all or some coefficients at element locations, other than the third element location γ_(r) in the element locations

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ and a coefficient at the location γ_(r).

$\bigcup\limits_{m \in A}\left\{ {t_{r,m,1},\ldots\mspace{14mu},t_{r,m,K_{m,r}}} \right\}$ is a set obtained by obtaining a union set of sets {t_(r,m,1), . . . , t_(r,m,K) _(m) } corresponding to all elements m that belong to the set A.

Optionally, quantities of quantization bits of at least two relative values in the relative values that are of the coefficients and that are included in the second indication information are different.

Optionally,

$W_{1} = \begin{bmatrix} X & 0 \\ 0 & X \end{bmatrix}$ is a matrix of N rows and 2L columns, and X=[b_(k) ₀ . . . b_(k) _(L-1) ] is a matrix of is of N/2 rows and L columns, b_(k) _(i) (0≤i≤L−1) belongs to a vector set B={b₀, b₁, . . . b_(M-1)}, the PMI further includes third indication information, the third indication information is used to indicate the L vectors b_(k) ₀ , . . . , b_(k) _(L-1) , M is a positive integer, and M is greater than or equal to L.

Optionally V_(2,r)=[V_(2,r,1) . . . V_(2,r,T)], a t^(th) column in V_(2,r) is V_(2,r,t)=[a_(r,1,t) . . . a_(r,2L,t)]^(T), 1≤t≤T, and [ ]^(T) represents transposing.

It may be understood that, for a specific implementation of the functional units included in the second communications apparatus 120, refer to the foregoing embodiment. Details are not described herein again.

Methods or algorithm steps described in combination with the content disclosed in the embodiments of the present invention may be implemented by hardware, or may be implemented by a processor by executing a software instruction. The software instruction may include a corresponding software module. The software module may be stored in a RAM, a flash memory, a ROM, an erasable programmable read only memory (EPROM), an electrically erasable programmable read only memory (EEPROM), a register, a hard disk, a removable hard disk, a compact disc read-only memory (CD-ROM), or any other form of storage medium well-known in the art. For example, a storage medium is coupled to a processor, so that the processor can read information from the storage medium and write information into the storage medium. Certainly, the storage medium may be a component of the processor. The processor and the storage medium may be located in an ASIC. In addition, the ASIC may be located in a transceiver or a relay device. Certainly, the processor and the storage medium may exist in a network device or a terminal device as discrete components.

A person skilled in the art should be aware that in the foregoing one or more examples, functions described in the embodiments of the present invention may be implemented by hardware, software, firmware, or any combination thereof. When the present invention is implemented by software, the foregoing functions may be stored in a computer-readable medium or transmitted as one or more instructions or code in a computer-readable medium. The computer-readable medium includes a computer storage medium and a communications medium, and the communications medium includes any medium that enables a computer program to be transmitted from one place to another. The storage medium may be any available medium accessible to a general-purpose or special-purpose computer.

In the foregoing specific implementations, the objectives, technical solutions, and benefits of the embodiments of the present invention are further described in detail. It should be understood that the foregoing descriptions are merely specific implementations of the embodiments of the present invention, but are not intended to limit the protection scope of the embodiments of present invention. Any modification, equivalent replacement, or improvement made based on technical solutions of the embodiments of the present invention shall fall within the protection scope of the embodiments of the present invention. 

The invention claimed is:
 1. A precoding matrix indicator (PMI) reporting method, comprising: determining by a first communications apparatus, a rank indicator (RI) and a PMI, wherein the PMI is used to determine R precoding matrices W₁, . . . , W_(R), and an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(r), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F) is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2x) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and R is a nonnegative integer, N, L, F, T, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T; and sending, by the first communications apparatus, the RI and the PMI.
 2. The method according to claim 1, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1,{1, . . . , R}.
 3. The method according to claim 2, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 4. The method according to claim 3, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n), associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.
 5. A precoding matrix indicator (PMI) receiving method, comprising: receiving, by a second communications apparatus, a rank indicator (RI) and a PMI and determining, by the second communications apparatus, R precoding matrices W₁, . . . , W_(R) based on the PMI, wherein an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(r), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F), is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and the RI is a nonnegative integer, N, L, F, T, R, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T.
 6. The method according to claim 5, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1, . . . , R}.
 7. The method according to claim 6, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 8. The method according to claim 7, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.
 9. A communications apparatus, comprising at least one processor, a transmitter, and a non-transitory computer-readable storage medium coupled to the at least one processor and storing programming instructions for execution by the at least one processor, the programming instructions cause the communications apparatus to: determine a rank indicator (RI) and a precoding matrix indicator (PMI), wherein the PMI is used to determine R precoding matrices W₁, W_(R), and an r^(th) precoding matrix in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(r), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F) is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and the RI is a nonnegative integer, N, L, F, T, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T; and cause the transmitter to send the RI and the PMI.
 10. The apparatus according to claim 9, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1, . . . , R}.
 11. The apparatus according to claim 10, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 12. The apparatus according to claim 11, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.
 13. A communications apparatus, comprising at least one processor, a receiver, and a non-transitory computer-readable storage medium coupled to the at least one processor and storing programming instructions for execution by the at least one processor, the programming instructions instruct the at least one processor to: cause the receiver to receive a rank indicator (RI) and a precoding matrix indicator (PMI) and determine R precoding matrices W₁, . . . , W_(R) based on the PMI, wherein an r^(th) precoding matrix in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(r), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F) is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r) and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2,r) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and the RI is a nonnegative integer, N, L, F, T, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T.
 14. The apparatus according to claim 13, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1, . . . , R}.
 15. The apparatus according to claim 14, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 16. The apparatus according to claim 15, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th)(n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations _(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.
 17. A non-transitory computer readable medium, comprising computer program instructions which when executed by one or more processors cause a communications apparatus to execute the steps of: determining a rank indicator (RI) and a PMI, wherein the PMI is used to determine R precoding matrices W₁, . . . , W_(R), and an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(r), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F) is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2x) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and R is a nonnegative integer, N, L, F, T, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T; and sending the RI and the PMI.
 18. The non-transitory computer readable medium according to claim 17, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1, . . . , R}.
 19. The non-transitory computer readable medium according to claim 18, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 20. The non-transitory computer readable medium according to claim 19, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer.
 21. A non-transitory computer readable medium, comprising computer program instructions which when executed by one or more processors cause a communications apparatus to execute the steps of: receiving a rank indicator (RI) and a PMI; and determining R precoding matrices W₁, . . . , W_(R) based on the PMI, wherein an r^(th) precoding matrix W_(r) in the R precoding matrices satisfies w_(r)=w₁×v_(2,r)×W_(F), and r∈{1, . . . , R}; W₁ is a matrix of N rows and 2L columns, V_(2,r) is a matrix of 2L rows and T columns, W_(F) is a Discrete Fourier Transform (DFT) matrix of T rows and F columns, R is indicated by the RI, and l∈{1, . . . , 2L}; the PMI comprises first indication information and second indication information, the first indication information comprises location index information, the location index information is used to indicate K_(m,r) element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) ∈{1, . . . T}on an m^(th) row of V_(2,r), and the second indication information is used to indicate K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) at the element locations t_(r,m,1), . . . , t_(r,m,K) _(m,r) on the m^(th) row of V_(2,r), wherein V_(2x) is determined based on the K_(m,r) element locations and the K_(m,r) complex coefficients a_(r,m,t) _(r,m,i) , m∈{1, . . . , 2L}, and i∈{1, . . . , K_(m.r)}; and the RI is a nonnegative integer, N, L, F, T, R, and K_(m,r) are all positive integers, K_(m,r) is less than T, and F is equal to T.
 22. The non-transitory computer readable medium according to claim 21, wherein R≥1, and the location index information indicates R groups of locations, wherein an r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations is used to indicate the K_(m,r) element locations on at least two rows in V_(2,r), that is, n∈{1, . . . , 2L}, m∈{1, . . . , 2L}, and n≠m, and it satisfies that t_(rmj)=t_(rnj)=c_(rj), K_(m,r)=K_(n,r)=K_(r), i∈{1, . . . , k,}, and r∈{1, . . . , R}.
 23. The non-transitory computer readable medium according to claim 22, wherein the location index information comprises indication information of M_(r) reference locations, the indication information of the M_(r) reference locations is used to indicate the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and M_(r) is a positive integer less than T.
 24. The non-transitory computer readable medium according to claim 23, wherein the location index information further comprises a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer; or a window size X_(r,n) associated with an n^(th) (n=1, . . . , M_(r)) reference location in the M_(r) reference locations is configured by using first configuration information, the M_(r) reference locations and the M_(r) window sizes are used to determine the r^(th) group of locations c_(r,1), . . . , c_(r,K) _(r) in the R groups of locations, and X_(r,n) is a positive integer. 